The optimal absolute ratio for online bin packing
نویسندگان
چکیده
منابع مشابه
The optimal absolute ratio for online bin packing
We present an online bin packing algorithm with absolute competitive ratio 5/3, which is optimal.
متن کاملOnline Colored Bin Packing
In the Colored Bin Packing problem a sequence of items of sizes up to 1 arrives to be packed into bins of unit capacity. Each item has one of c ≥ 2 colors and an additional constraint is that we cannot pack two items of the same color next to each other in the same bin. The objective is to minimize the number of bins. In the important special case when all items have size zero, we characterize ...
متن کاملOnline Stochastic Bin Packing
Motivated by the problem of packing Virtual Machines on physical servers in the cloud, we study the problem of one-dimensional online stochastic bin packing. Items with sizes sampled independent and identically (i.i.d.) from a distribution with integral support arrive as a stream and must be packed on arrival in bins of size B, also an integer. The size of an item is known when it arrives and t...
متن کاملComparing online algorithms for bin packing problems
The relative worst-order ratio is a measure of the quality of online algorithms. In contrast to the competitive ratio, this measure compares two online algorithms directly instead of using an intermediate comparison with an optimal offline algorithm. In this paper, we apply the relative worst-order ratio to online algorithms for several common variants of the bin packing problem. We mainly cons...
متن کاملPerfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing
We consider the one-dimensional bin packing problem under the discrete uniform distributions U{j, k}, 1 ≤ j ≤ k − 1, in which the bin capacity is k and item sizes are chosen uniformly from the set {1, 2, . . . , j}. Note that for 0 < u = j/k ≤ 1 this is a discrete version of the previously studied continuous uniform distribution U(0, u], where the bin capacity is 1 and item sizes are chosen uni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2019
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2018.11.005